agv routing
Deep Reinforcement Learning for AGV Routing
This mapping will be included in an AGV Picking Simulation Model that will be used for testing our routing strategies. Dijkstra's algorithm is an optimization algorithm that solves the single-source shortest path problem for a directed graph with weighted edges (non-negative weights). This length can be the absolute length of the path, it can also be computed considering other constraints situated on the edges or the nodes. These parameters will vary in time, therefore let's use a reinforcement learning approach to select the optimal route from these candidates in accordance with this state.